Cyclic queueing networks with subexponential service times

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic Queueing Networks with Subexponential Service Times

For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.

متن کامل

Tail Asymptotics of Queueing Networks with Subexponential Service Times

To myself and my parents... iii ACKNOWLEDGEMENTS Throughout my graduate studies, I am indebted to many people for their help and encouragement. First of all, I would like to thank my advisor Prof. Hayriye Ayhan. It is impossible for me to express in words my full appreciation. However, I would like to thank all of her advice and support during my graduate studies. I would not have completed thi...

متن کامل

Asymptotics of Stochastic Networks with Subexponential Service Times

We analyse the tail behaviour of stationary response times in the class of open stochastic networks with renewal input admitting a representation as (max; +){linear systems. For a K-station tandem network of single server queues with innnite buuer capacity, which is one of the simplest models in this class, we rst show that if the tail of the service time distribution of one server, say server ...

متن کامل

Tandem queues with subexponential service times and finite buffers

We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room for finished customers after the last station but the size of the buffer between two consecutive stations is finite. Using (max,+) linear recursions, we investigate the tail asymptotics of transient response times and w...

متن کامل

A queueing model with dependence between service and interarrival times

We consider a storage model that can be either interpreted as a certain queueing model with dependence between a service request and the subsequent interarrival time, or as a fluid production/inventory model with a two-state random environment. We establish a direct link between the workload distributions· of the queueing model and the production/inventory model, and we present a detailed analy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2004

ISSN: 0021-9002,1475-6072

DOI: 10.1017/s0021900200020556